全文获取类型
收费全文 | 14408篇 |
免费 | 311篇 |
国内免费 | 343篇 |
专业分类
化学 | 3932篇 |
晶体学 | 10篇 |
力学 | 390篇 |
综合类 | 121篇 |
数学 | 6297篇 |
物理学 | 4312篇 |
出版年
2024年 | 4篇 |
2023年 | 38篇 |
2022年 | 54篇 |
2021年 | 51篇 |
2020年 | 118篇 |
2019年 | 117篇 |
2018年 | 141篇 |
2017年 | 166篇 |
2016年 | 188篇 |
2015年 | 90篇 |
2014年 | 211篇 |
2013年 | 861篇 |
2012年 | 536篇 |
2011年 | 660篇 |
2010年 | 547篇 |
2009年 | 2945篇 |
2008年 | 2330篇 |
2007年 | 1062篇 |
2006年 | 571篇 |
2005年 | 485篇 |
2004年 | 453篇 |
2003年 | 327篇 |
2002年 | 288篇 |
2001年 | 244篇 |
2000年 | 209篇 |
1999年 | 184篇 |
1998年 | 286篇 |
1997年 | 245篇 |
1996年 | 96篇 |
1995年 | 309篇 |
1994年 | 249篇 |
1993年 | 216篇 |
1992年 | 281篇 |
1991年 | 232篇 |
1990年 | 79篇 |
1989年 | 85篇 |
1988年 | 56篇 |
1987年 | 12篇 |
1986年 | 9篇 |
1985年 | 6篇 |
1984年 | 9篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
设V是一个n维线性空间,V_x~m(G)为V上的张量对称类.A为V的线性算子T的矩阵,K(A)为V_x~m(G)上的诱导线性算子K(T)的矩阵.本文从K(A)的数值半径Υ(K(A))和可分数值半径Υ_x(K(A))定义出发,研究了Υ(K(A))、Υ_x(K(A))与范数||A||_p(1≤p≤2)、广义矩阵函数d_x~G(A)的关系,得到了它们之间的两个不等式. 相似文献
12.
A parallel method for time discretization of parabolic equations based on Laplace transformation and quadrature 总被引:5,自引:0,他引:5
We consider the discretization in time of an inhomogeneous parabolicequation in a Banach space setting, using a representation ofthe solution as an integral along a smooth curve in the complexleft half-plane which, after transformation to a finite interval,is then evaluated to high accuracy by a quadrature rule. Thisreduces the problem to a finite set of elliptic equations withcomplex coefficients, which may be solved in parallel. The paperis a further development of earlier work by the authors, wherewe treated the homogeneous equation in a Hilbert space framework.Special attention is given here to the treatment of the forcingterm. The method is combined with finite-element discretizationin spatial variables. 相似文献
13.
Solving large scale linear systems efficiently plays an important role in a petroleum reservoir simulator, and the key part is how to choose an effective parallel preconditioner. Properly choosing a good preconditioner has been beyond the pure algebraic field. An integrated preconditioner should include such components as physical background, characteristics of PDE mathematical model, nonlinear solving method, linear 相似文献
14.
Gowravaram Sabitha G.S.Kiran Kumar ReddyK.Bhaskar Reddy J.S. Yadav 《Tetrahedron letters》2003,44(34):6497-6499
The three component condensation of an aldehyde, a β-keto ester and urea (thiourea) in the presence of a catalytic amount of VCl3 is disclosed for the solution phase synthesis of dihydropyrimidinones. The ease of synthesis and work-up allowed the parallel synthesis of a 48-membered library of dihydropyrimidinones quickly and efficiently in good yields. 相似文献
15.
We examine several interesting relationships and expressions involving Fourier-Feynman transform, convolution product and
first variation for functionals in the Fresnel class F(B) of an abstract Wiener space B. We also prove a translation theorem and Parseval's identity for the analytic Feynman integral.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
16.
Toshihiro Kobayashi 《Mathematical Methods in the Applied Sciences》2004,27(1):79-89
This paper is concerned with global stabilization of an undamped non‐linear string in the case where any velocity feedback is not available. The linearized system has an infinite number of poles and zeros on the imaginary axis. In the case where any velocity feedback is not available, a parallel compensator is effective. The stabilizer is constructed for the augmented system which consists of the controlled system and a parallel compensator. It is proved that the string can be stabilized by linear boundary control. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
17.
基于改进遗传算法的布局优化子问题 总被引:2,自引:0,他引:2
本针对子问题,构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题,数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题,所以利用该算法可以找到整个布局优化问题的全局最优解。 相似文献
18.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
19.
We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1. 相似文献
20.
I. Nakai 《Commentarii Mathematici Helvetici》1998,73(2):177-205
A curvilinear d-web W = (F
1 , . . . , F
d
) is a configuration of d curvilinear foliations F
i
on a surface. When d = 3, Bott connections of the normal bundles of F
i
extend naturally to equal affine connection, which is called Chern connection. For 3 < d, this is the case if and only if the modulus of tangents to the leaves of F
i
at a point is constant. A d-web is associative if the modulus is constant and weakly associative if Chern connections of all 3-subwebs have equal curvature form. We give a geometric interpretation of the curvature form
in terms of fake billiard in §2, and prove that a weakly associative d-web is associative if Chern connections of triples of the members are non flat, and then the foliations are defined by members
of a pencil (projective linear family of dim 1) of 1-forms. This result completes the classification of weakly associative
4-webs initiated by Poincaré, Mayrhofer and Reidemeister for the flat case. In §4, we generalize the result for n + 2-webs of n-spaces.
Received: September 23, 1996 相似文献